Selecting biomarkers for building optimal treatment selection rules by using kernel machines
نویسندگان
چکیده
منابع مشابه
Kernel Selection for Semi-Supervised Kernel Machines
Existing semi-supervised learning methods are mostly based on either the cluster assumption or the manifold assumption. In this paper, we propose an integrated regularization framework for semi-supervised kernel machines by incorporating both the cluster assumption and the manifold assumption. Moreover, it supports kernel learning in the form of kernel selection. The optimization problem involv...
متن کاملKernel/feature Selection for Support Vector Machines
Support Vector Machines are classifiers with architectures determined by kernel functions. In these proceedings we propose a method for selecting the best SVM kernel for a given classification problem. Our method searches for the best kernel by remapping the data via a kernel variant of the classical Gram-Schmidt orthonormalization procedure then using Fisher’s linear discriminant on the remapp...
متن کاملParameters selection in gene selection using Gaussian kernel support vector machines by genetic algorithm.
In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear statistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer ...
متن کاملKernel Selection in Support Vector Machines Using Gram-Matrix Properties
We describe an approach to kernel selection in Support Vector Machines (SVMs) driven by the Gram matrix. Our study extracts properties from this matrix (e.g., Fisher’s discriminant, Bregman’s divergence) using different kernel functions (linear, polynomial, Gaussian, Laplacian, Bessel and ANOVARBF), and incorporates such properties as meta-features within a meta-learning framework. The goal is ...
متن کاملOptimal kernel selection for density estimation
We provide new general kernel selection rules thanks to penalized least-squares criteria. We derive optimal oracle inequalities using adequate concentration tools. We also investigate the problem of minimal penalty as described in [BM07].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Royal Statistical Society: Series C (Applied Statistics)
سال: 2019
ISSN: 0035-9254,1467-9876
DOI: 10.1111/rssc.12379